New Encodings of Pseudo-Boolean Constraints into CNF
نویسندگان
چکیده
This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
منابع مشابه
A Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
A Pseudo-Boolean constraint, PB-constraint, is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a family of algorithms for translating PseudoBoolean constraints into CNF clauses. These algorithms are centered around the idea of rewriting a PB-constraint as the conjunction of a set of easier to tra...
متن کاملPBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF
PBLib is an easy-to-use and efficient library, written in C++, for translating pseudo-Boolean (PB) constraints into CNF. We have implemented fifteen different encodings of PB constraints. Our aim is to use efficient encodings, in terms of formula size and whether unit propagation maintains generalized arc consistency. Moreover, PBLib normalizes PB constraints and automatically uses a suitable e...
متن کاملOn the CNF encoding of cardinality constraints and beyond
In this report, we propose a quick survey of the currently known techniques for encoding a Boolean cardinality constraint into a cnf formula, and we discuss about the relevance of these encodings. We also propose models to facilitate analysis and design of cnf encodings for Boolean constraints.
متن کاملBDDs for Pseudo-Boolean Constraints - Revisited
Pseudo-Boolean constraints are omnipresent in practical applications, and therefore a significant effort has been devoted to the development of good SAT encoding techniques for these constraints. Several of these encodings are based on building Binary Decision Diagrams (BDDs) and translating these into CNF. Indeed, BDD-based encodings have important advantages, such as sharing the same BDD for ...
متن کاملPBLib – A C++ Toolkit for Encoding Pseudo-Boolean Constraints into CNF
Many different encodings for PB constraints into conjunctive normal form (CNF) have been proposed in the past. The PBLib project starts to collect and implement these encodings to be able to encode PB constraints in a very simple, but effective way. The aim is not only to generate as few clauses as possible, but also using encodings that maintain generalized arc consistency by unit propagation,...
متن کامل